The Universal Generalization Problem
نویسنده
چکیده
Locke, Berkeley, Gentzen gave different justifications of universal generalization. In particular, Gentzen’s justification is the one currently used in most logic textbooks. In this paper I argue that all such justifications are problematic, and propose an alternative justification which is related to the approach to generality of Greek mathematics.
منابع مشابه
A Study on the Commentary of Historical Verses with an Emphasis on the Rule of Al-Ibrah
One of the prevalent commentary rules about commentary of the historical verses which has a certain revelation occasion and refers to a specific time and place is the rule of alibrah being stated as: take in consideration universality of the word not particularity of the occasion. The source of this rule refers to the verses which have universal word and particular occasion. The referent of the...
متن کاملUniversal Triple I Method for Fuzzy Reasoning and Fuzzy Controller
As a generalization of the triple I method, the universal triple Imethod is investigated from the viewpoints of both fuzzy reasoningand fuzzy controller. The universal triple I principle is putforward, which improves the previous triple I principle. Then,unified form of universal triple I method is established based onthe (0,1)-implication or R-implication. Moreover, the reversibilityproperty o...
متن کاملOn Generalization of Sturm-Liouville Theory for Fractional Bessel Operator
In this paper, we give the spectral theory for eigenvalues and eigenfunctions of a boundary value problem consisting of the linear fractional Bessel operator. Moreover, we show that this operator is self-adjoint, the eigenvalues of the problem are real, and the corresponding eigenfunctions are orthogonal. In this paper, we give the spectral theory for eigenvalues and eigenfunctions...
متن کاملQuantified Constraint Satisfaction Problems: Closure Properties, Complexity, and Algorithms
There has been much prior work on understanding the complexity of the constraint satisfaction problem (CSP), a broad framework capturing many combinatorial problems. This paper studies the complexity of the quantified constraint satisfaction problem (QCSP), a natural and strict generalization of the CSP. The CSP can be viewed as the problem of deciding whether or not existentially quantified fo...
متن کاملApplications of Levin’s Universal Optimal Search Algorithm
New applications of Levin’s Universal Optimal Search are presented in this paper . Using this method one finds solutions to a few chosen problems. Such solutions are characterized by possibility of the maximal generalization. In the deterministic version of the Universal Optimal Search algorithm one can always generate the best solution. It is shown that it is possible to find a solution by thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009